A Isabelle definitions and theorems
ثبت نشده
چکیده
This document describes proofs in Isabelle of some results relevant to the paper A Proof Theoretic Analysis of Intruder Theories. It contains proofs formulated for the system for Dolev-Yao intruders considered in Section 6, although the proofs include cut-admissibility and the existence of normal derivations, which are given in the paper for more complex theories, in Sections 3 and 4. The proofs may be found in the files Intruder.{thy,ML} and Int DC.{thy,ML} in http://users.rsise. anu.edu.au/∼jeremy/isabelle/2005/spi/.
منابع مشابه
Basic Geometric Properties of Triangles
In this work, we define angles between vectors and between three points. Building on this, we prove basic geometric properties of triangles, such as the Isosceles Triangle Theorem, the Law of Sines and the Law of Cosines, that the sum of the angles of a triangle is π, and the congruence theorems for triangles. The definitions and proofs were developed following those by John Harrison in HOL Lig...
متن کاملPrimitively (Co)recursive Definitions for Isabelle/HOL
Isabelle/HOL has recently been enriched with a definitional package for datatypes and codatatypes. The package introduces the specified types and derives auxiliary constants and characteristic theorems, notably (co)recursors and (co)induction principles. We now introduce support for high-level specifications of (co)recursive functions, in the form of three commands: primrec, primcorec, and prim...
متن کاملSet Theory or Higher Order Logic to Represent Auction Concepts in Isabelle?
When faced with the question of how to represent properties in a formal proof system any user has to make design decisions. We have proved three of the theorems from Maskin’s 2004 survey article on Auction Theory using the Isabelle/HOL system, and we have verified software code that implements combinatorial Vickrey auctions. A fundamental question in this was how to represent some basic concept...
متن کاملCSP-Prover – a Proof Tool for the Verification of Scalable Concurrent Systems
The process algebra Csp [1] [4] [15] [16] is a formal method devoted to the modelling as well as to the analysis and verification of concurrent systems. It is a speciality of Csp that it captures both, the concurrent system as well as its desired properties, as specifications: Let Sys be the formal Csp model of a concurrent system, let P be a property formulated in Csp – such a property could, ...
متن کاملLifting and Transfer: A Modular Design for Quotients in Isabelle/HOL
Quotients, subtypes, and other forms of type abstraction are ubiquitous in formal reasoning with higher-order logic. Typically, users want to build a library of operations and theorems about an abstract type, but they want to write definitions and proofs in terms of a more concrete representation type, or “raw” type. Earlier work on the Isabelle Quotient package [3, 4] has yielded great progres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010